Deciding All Behavioral Equivalences at Once: A Game for Linear-Time--Branching-Time Spectroscopy
نویسندگان
چکیده
We introduce a generalization of the bisimulation game that finds distinguishing Hennessy-Milner logic formulas from every finitary, subformula-closed language in van Glabbeek's linear-time--branching-time spectrum between two finite-state processes. identify relevant dimensions measure expressive power to yield belonging coarsest behavioral preorders and equivalences; compared processes are equivalent each coarser equivalence spectrum. prove induced algorithm can determine best fit (in)equivalences for pair
منابع مشابه
A Tool Set for deciding Behavioral Equivalences
This paper deals with veriication methods based on equivalence relations between labeled transition systems. More precisely, we are concerned by two practical needs: how to eeciently minimize and compare labeled transition systems with respect to bisimulation or simulation-based equivalence relations. First, we recall the principle of the classical algorithms for the existing equivalence relati...
متن کاملA Linear-Time-Branching-Time Spectrum of Behavioral Specification Theories
We propose behavioral specification theories for most equivalences in the linear-time–branching-time spectrum. Almost all previous work on specification theories focuses on bisimilarity, but there is a clear interest in specification theories for other preorders and equivalences. We show that specification theories for preorders cannot exist and develop a general scheme which allows us to defin...
متن کاملDeciding branching time properties for asynchronous programs
Asynchronous programming is a paradigm that supports asynchronous function calls in addition to synchronous function calls. Programs in such a setting can be modeled by automata with counters that keep track of the number of pending asynchronous calls for each function as well as a call stack for synchronous recursive computation. These programs have the restriction that an asynchronous call is...
متن کاملLinear Time Datalog for Branching Time Logic
In this paper we show that Datalog is well-suited as a temporal veriication language. Dat-alog is a well-known database query language relying on the logic programming paradigm. We introduce Datalog LITE, a fragment of Datalog with well-founded negation, and present a linear time model checking algorithm for Datalog LITE. We show that Datalog LITE subsumes temporal languages such as CTL and the...
متن کاملAll-at-once solution of time-dependent Stokes control
The solution of time-dependent PDE-constrained optimization problems subject to unsteady flow equations presents a challenge to both algorithms and computers. In this paper we present an all-at-once approach where we solve for all time-steps of the discretized unsteady Stokes problem at once. The most desirable feature of this approach is that for all steps of an iterative scheme we only need a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2022
ISSN: ['1860-5974']
DOI: https://doi.org/10.46298/lmcs-18(3:19)2022